An Algorithm for Type-Checking Dependent Types
نویسنده
چکیده
We present a simple type-checker for a language with dependent types and let expressions, with a simple proof of correctness.
منابع مشابه
Compositional and Decidable Checking for Dependent Contract Types
Simple type systems perform compositional reasoning in that the type of a term depends only on the types of its subterms, and not on their semantics. Contracts offer more expressive abstractions, but static contract checking systems typically violate those abstractions and base their reasoning directly upon the semantics of terms. Pragmatically, this noncompositionality makes the decidability o...
متن کاملExecutable Refinement Types
Executable Refinement Types by Kenneth L. Knowles Precise specifications are integral to effective programming practice. Existing specification disciplines such as structural type systems, dynamic contracts, and extended static checking all suffer from limitations such as imprecision, false positives, false negatives, or excessive manual proof burden. New ways of expressing and enforcing progra...
متن کاملAn Implementation of Type: Type
We present a denotational semantics of a type system with dependent types, where types are interpreted as finitary projections. We prove then the correctness of a type-checking algorithm w.r.t. this semantics. In this way, we can justify some simple optimisation in this algorithm. We then sketch how to extend this semantics to allow a simple record mechanism with manifest fields.
متن کاملDependent Session Types for Evolving Multiparty Communication Topologies
Many application-level distributed protocols and parallel algorithms are dynamic in nature: the number of participants, messages or repetitions is only known at run-time, and the communication topology may be altered during the execution. This paper proposes a dependent type theory for multiparty sessions which can statically guarantee type-safe, deadlock-free multiparty interactions among proc...
متن کاملAn Algorithm for Predicting Recurrence of Breast Cancer Using Genetic Algorithm and Nearest Neighbor Algorithm
Introduction: Breast cancer is one of the most common types of cancer and the most common type of malignancy in women, which has been growing in recent years. Patients with this disease have a chance of recurrence. Many factors reduce or increase this probability. Data mining is one of the methods used to detect or anticipate cancers, and one of its most common uses is to predict the recurrence...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Sci. Comput. Program.
دوره 26 شماره
صفحات -
تاریخ انتشار 1996